Exploiting Locality in a TMS
نویسنده
چکیده
This paper presents a new approach for exploiting Truth Maintenance Systems(TMSs) which makes them simpler to use without necessarily incurring a substantial performance penalty. The basic intuition behind this approach is to convey the locality of the knowledge representation of the problem solver to the TMS. The TMS then uses this locality information to control and restrict its inferences. The new TMSs accept arbitrary propositional formulae as input and use general Boolean Constraint Propagation(BCP) to answer queries about whether a particular literal follows from the formulae. Our TMS exploits the observation that if the set of propositional formulae are converted to their prime implicates, then BCP is both efficient and logically complete. This observation allows the problem solver to influence the degree of completeness of the TMS by controlling how many implicates are constructed. This control is exerted by using the locality in the original task to guide which combinations of formulae should be reduced to their prime implicates. This approach has been implemented and tested both within Assumption-Based Truth Maintenance Systems and Logic-Based Truth Maintenance Systems.
منابع مشابه
Compiling Devices and Processes
This paperpresents a new approach for exploiting Truth Maintenance Systems(TMSs in which the inference engine can convey locality in its knowledge to the TMS . This approach is ideally suited for systems which reason about the physical world because much of knowledge is inherently local, i .e ., the constraints for a particular component or process usually only interact with constraints of phys...
متن کاملOptimizing Caching Policy at Base Stations by Exploiting User Preference and Spatial Locality
Most prior works of proactive caching at wireless edge optimize caching policies under the following assumptions: the preference of each user is identical to content popularity, all users request contents with the same active level and at uniformly-distributed locations. In this paper, we investigate what happens without these assumptions. To this end, we establish a framework to optimize cachi...
متن کاملLocalized Temporal Reasoning Using Subgoalsand
We are concerned with temporal reasoning problems where there is uncertainty about the order in which events occur. The task of temporal reasoning is to derive an event sequence consistent with a given set of ordering constraints to achieve a goal. Previous research shows that the associated decision problems are hard even for very restricted cases. In this paper, we investigate locality in eve...
متن کاملThe Case for Exploiting Packet Loss Locality in Multicast Loss Recovery
This paper makes the case for exploiting packet loss locality in the loss recovery of reliable multicast protocols, such as SRM [4]. We claim that packet loss locality in IP multicast transmissions can be exploited by simple caching schemes. In such schemes, receivers cache information about the recovery of recently recovered packets and use this information to expedite the recovery of subseque...
متن کامل